Fast Binary Translation: Translation Efficiency and Runtime Efficiency Mathias Payer Department of Computer Science ETH Zurich Abstract—Fast binary translation is a key component for

Source URL: www.nebelwelt.net

VIDEO-DRIVEN ANIMATION OF HUMAN BODY SCANS Edilson de Aguiar, Rhaleb Zayer, Christian Theobalt, Marcus Magnor and Hans-Peter Seidel MPI Informatik, Saarbr¨ucken, Germany ABSTRACT We present a versatile, fast and simple

Source URL: people.mpi-inf.mpg.de

FAST INVERSE SQUARE ROOT CHRIS LOMONT Abstract. Computing reciprocal square roots is necessary in many applications, such as vector normalization in video games. Often, some loss of precision is acceptable for a large in

Source URL: www.matrix67.com

FLINT 1.6: Fast Library for Number Theory William B. Hart and Andy Novocin and previously David Harvey December 24, 2010 Contents

Source URL: www.flintlib.org

• Algebra
• Mathematics
• Abstract algebra
• Polynomials
• Computer algebra
• Commutative algebra
• Factorization
• Vector space
• Homogeneous polynomial
• Resultant

Fast recursive coding based on grouping of Symbols Nikolay Ponomarenko, Vladimir Lukin, Karen Egiazarian, Jaakko Astola Abstract — A novel fast recursive coding technique is proposed. It operates with only integer valu

Source URL: www.ponomarenko.info

Finite-Dimensional Lie Algebras for Fast Diffeomorphic Image Registration Miaomiao Zhang and P. Thomas Fletcher Scientific Computing and Imaging Institute, University of Utah, Salt Lake City, UT Abstract. This paper pre

Source URL: www.sci.utah.edu

A Provably Secure Elliptic Curve Scheme with Fast Encryption David Galindo1 , Sebasti` a Mart´ın1 , Tsuyoshi Takagi2 and Jorge L. Villar1 1

Source URL: www.dgalindo.es

• Cryptography
• Abstract algebra
• Algebra
• Elliptic curves
• Group theory
• Supersingular elliptic curve
• Trapdoor function
• Finite fields
• Elliptic curve
• Lenstra elliptic curve factorization
• Elliptic curve primality

PAINLESS RECONSTRUCTION FROM MAGNITUDES OF FRAME COEFFICIENTS RADU BALAN, BERNHARD G. BODMANN, PETER G. CASAZZA AND DAN EDIDIN Abstract. The primary goal of this paper is to develop fast algorithms for

Source URL: www.math.umd.edu

LU-CS-TR:LUNFD6/(NFCS–)], Dept of Computer Science, Lund University, Sweden FASTER SUFFIX SORTING N. JESPER LARSSON∗ AND KUNIHIKO SADAKANE† Abstract. We propose a fast and memory efficient a

Source URL: www.larsson.dogma.net